160 research outputs found
The Complexity of Iterated Strategy Elimination
We consider the computational complexity of the question whether a certain
strategy can be removed from a game by means of iterated elimination of
dominated strategies. In particular, we study the influence of different
definitions of domination and of the number of different payoff values. In
addition, the consequence of restriction to constant-sum games is shown
The descriptive theory of represented spaces
This is a survey on the ongoing development of a descriptive theory of
represented spaces, which is intended as an extension of both classical and
effective descriptive set theory to deal with both sets and functions between
represented spaces. Most material is from work-in-progress, and thus there may
be a stronger focus on projects involving the author than an objective survey
would merit.Comment: survey of work-in-progres
- …